Enhanced Use Case Map Traversal Semantics

نویسندگان

  • Jason Kealey
  • Daniel Amyot
چکیده

The Use Case Map (UCM) notation enables the use of graphical scenarios to model grey-box views of a system’s operational requirements and behaviour, in context. The scenario traversal mechanism is the most popular UCM analysis technique but its current tool support in UCMNav is limited and hard to use, and the high-coupling of its features makes it difficult to maintain and evolve. This paper presents major enhancements to the recent jUCMNav Eclipse plug-in consisting of a new scenario traversal semantics accompanied by enhanced trace transformations to Message Sequence Charts. In addition, this paper identifies a set of semantic variation points which lay the groundwork for notational clarifications and user-defined semantic profiles.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Enhancing the Business Analysis Function with Semantics

This paper outlines a prototypical work bench which offers semantically enhanced analytical capabilities to the business analyst. The business case for such an environment is outlined and user scenario development used to illustrate system requirements. Based upon ideas from meta-discourse and exploiting advances within the fields of ontology engineering, annotation, natural language processing...

متن کامل

A model of the formation of a self-organized cortical representation of color

In this paper we address the problem of understanding the cortical processing of color information. Unravelling the cortical representation of color is a difficult task, as the neural pathways for color processing have not been fully mapped, and there are few computational modelling efforts devoted to color. Hence, we first present a conjecture for an ideal target color map based on principles ...

متن کامل

Stratego/XT An Annotated Bibliography

The first ideas about programmable rewriting strategies supporting generic term traversal were developed in the algebraic specification formalism ASF+SDF [3]. That paper introduces the 2 (all) and 3 (one) traversal primitives, and their use in the definition of full term traversals such as bottomup, topdown, and innermost. The calculus of strategy operators is further developed and formalized u...

متن کامل

Term Rewriting with Type-safe Traversal Functions

Term rewriting is an appealing technique for performing program analysis and program transformation. Tree (term) traversal is frequently used but is not supported by standard term rewriting. In this paper, many-sorted rst-order term rewriting is extended with automatic tree traversal by adding two primitive tree traversal strategies and complementing them with three types of traversals. These s...

متن کامل

Defining Standard Prolog in Rewriting Logic

The coincidence between the model-theoretic and the procedural semantics of SLDresolution does not carry over to a Prolog system that also implements non-logical features like cut and whose depth-first search strategy is incomplete. The purpose of this paper is to present the key concepts of a new, simple operational semantics of Standard Prolog in the form of rewriting rules. We use a novel li...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007